File system on CRDT

نویسندگان

  • Mehdi Ahmed-Nacer
  • Stéphane Martin
  • Pascal Urso
چکیده

In this report we show how to manage a distributed hierarchical structure representing a file system. This structure is optimistically replicated, each user work on his local replica, and updates are sent to other replica. The different replicas eventually observe same view of file systems. At this stage, conflicts between updates are very common. We claim that conflict resolution should rely as little as possible on users. In this report we propose a simple and modular solution to resolve these problems and maintain data consistency. Key-words: Distributed System, CRDT, Optimistic Replication, Data Consistency, File system ∗ This work is a delivrable of french national research programs ConcRDanT (ANR-10BLAN-0208). Les systéme de fichier comme graphe en CRDT Résumé : Dans ce rapport nous allons montrer comment gérer une structure hiérarchique structuré représentant un système de fichier. Cette structure est basé sur la réplication optimiste, chaque utilisateur travaille sur une copie local et les mises à jour sont envoyées aux autres réplica. Les différentes répliques observent éventuellement la même vu du système de fichier. Á ce stade, des conflits entre les mises à jour peuvent avoir lieu. Nous demandons l’intervention des utilisateurs pour résoudre les conflits aussi peu que possible. Dans ce rapport, nous proposons une solution simple et modulaire pour résoudre ces problèmes en maintenant la cohérence des données. Mots-clés : Système distribué, Système de fichier, CRDT, Réplication optimiste 2Ce travail est aussi un délivrable de l’ANR ConcRDanT (ANR-10-BLAN-0208). File system on CRDT 3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract unordered and ordered trees CRDT

Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas of a distributed system are allowed to diverge but should eventually reach the same value if no more mutations occur. A new method to ensure eventual consis...

متن کامل

CRDTs: Consistency without concurrency control

A CRDT is a data type whose operations commute when they are concurrent. Replicas of a CRDT eventually converge without any complex concurrency control. As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer called Treedoc. We outline the design, implementation and performance of Treedoc. We discuss how the CRDT concept can be generalised, and its limitations. Key-words: Dat...

متن کامل

Scalable XML Collaborative Editing with Undo

Commutative Replicated Data-Type (CRDT) is a new class of algorithms that ensure scalable consistency of replicated data. It has been successfully applied to collaborative editing of texts without complex concurrency control. In this paper, we present a CRDT to edit XML data. Compared to existing approaches for XML collaborative editing, our approach is more scalable and handles all the XML edi...

متن کامل

Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation

We propose a new algorithm for computing the Riemann mapping of the unit disk to a polygon, also known as the Schwarz–Christoffel transformation. The new algorithm, CRDT (for cross-ratios of the Delaunay triangulation), is based on cross-ratios of the prevertices, and also on cross-ratios of quadrilaterals in a Delaunay triangulation of the polygon. The CRDT algorithm produces an accurate repre...

متن کامل

Bounds for the Crdt Algorithm

In [11] Driscoll and Vavasis described their CRDT algorithm for numerical computation of conformal maps from polygons to the unit disk. Although the method works well in practice, it is not proven to converge in all cases and they formulated a number of specific conjectures to quantify its behavior. In this note we prove one of these conjectures: that the initial guess of the CRDT algorithm alw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1207.5990  شماره 

صفحات  -

تاریخ انتشار 2012